Short Note: A Fast Iterative Algorithm for Generating Set Partitions

Fast Algorithms for Generating Integer Partitions

We present two new algorithms for generating integer partitions in the standard representation. They generate partitions in lexicographic and antilexicographic order, respectively. We prove that both algorithm generate partitions with constant average delay, exclusive of the output. The performance of all known integer partition algorithms is measured and compared, separately for the standard a...

A Fast Iterative Algorithm for Elliptic Interfaceproblemsrevised

A fast, second order accurate iterative method is proposed for the elliptic equation r ((x;y)ru) = f(x;y) in a rectangular region in 2 space dimensions. We assume that there is an irregular interface across which the coeecient , the solution u and its derivatives, and/or the source term f may have jumps. We are especially interested in the cases where the coeecients are piecewise constant and t...

A Fast Community Based Algorithm for Generating Web Crawler Seeds Set

In this paper, we present a new and fast algorithm for generating the seeds set for web crawlers. A typical crawler normally starts from a fixed set like DMOZ links, and then continues crawling from URLs which are found in these web pages. Crawlers are supposed to download more good pages in less iteration. Crawled pages are good if they have high PageRanks and are from different communities. I...

A Note On Rémy's Algorithm For Generating Random Binary Trees

Fast Algorithm for Generating Ascending Compositions

In this paper we give a fast algorithm to generate all partitions of a positive integer n. Integer partitions may be encoded as either ascending or descending compositions for the purposes of systematic generation. It is known the fact that the ascending composition generation algorithm is substantially more efficient than its descending composition counterpart. Using tree structures for storin...